2 00 9 Lower Bound for LMC complexity measure
نویسندگان
چکیده
Lower bound for the shape complexity measure of López-Ruiz-Mancini-Calbet (LMC), C LM C , is derived. Analytical relations for simple examples of the harmonic oscillator, the hydrogen atom and two-electron 'entangled artificial' atom proposed by Moshinsky are derived. Several numerical examples of the spherically confined model systems are presented as the test cases. For the homogeneous potential, C LM C is found to be independent of the parameters in the potential which is not the case for the non-homogeneous potentials.
منابع مشابه
ua nt - p h / 06 05 08 2 v 2 16 O ct 2 00 6 Comparison of SDL and LMC measures of complexity : Atoms as a testbed
The simple measure of complexity Γα,β of Shiner, Davison and Landsberg (SDL) and the statistical one C, according to López-Ruiz, Mancini and Calbet (LMC), are compared in atoms as functions of the atomic number Z. Shell effects i.e. local minima at the closed shells atoms are observed, as well as certain qualitative trends of Γα,β(Z) and C(Z). If we impose the condition that Γ and C behave simi...
متن کامل. A C ] 9 S ep 2 00 3 CASTELNUOVO - MUMFORD REGULARITY BY APPROXIMATION
The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for modules constructed by inductive combinatorial means. We apply these methods to bound the regularity of ideals constructed as combinations of linear ideals and...
متن کاملStatistical Measures of Complexity for Strongly Interacting Systems
In recent studies, new measures of complexity for nonlinear systems have been proposed based on probabilistic grounds, as the LMC measure (Phys. Lett. A 209 (1995) 321). All these measures share an intuitive consideration: complexity seems to emerge in nature close to instability points, as for example the phase transition points characteristic of critical phenomena. Here we discuss these measu...
متن کامل1 5 Ju l 2 00 9 Basis Reduction , and the Complexity of Branch - and - Bound Gábor Pataki and Mustafa Tural
The classical branch-and-bound algorithm for the integer feasibility problem Find x ∈ Q ∩ Zn, with Q = {
متن کاملar X iv : a st ro - p h / 00 02 21 9 v 1 1 0 Fe b 20 00 Changes in the long term intensity variations in Cyg X - 2 and LMC X - 3
We report the detection of changes in the long term intensity variations in two X-ray binaries Cyg X-2 and LMC X-3. In this work, we have used the long term light curves obtained with the All Sky Monitors (ASM) of the Rossi X-ray Timing Explorer (RXTE), GINGA, ARIEL 5 and VELA 5B and scanning modulation collimator of HEAO 1. It is found that in the light curves of both the sources, obtained wit...
متن کامل